Efficient computation of large scale transfer function dominant zeros
نویسندگان
چکیده
This paper describes efficient algorithms for the computation of dominant zeros of large scale transfer functions. The transfer function zeros are demonstrated to be equal to the poles of a new inverse system, which is valid even for the strictly proper case. This is a new finding, which is important from practical as well as theoretical viewpoints. Hence, the dominant zeros can be computed as the dominant poles of the inverse transfer function by the recent efficient SADPA and SAMDP algorithms. The importance of computing dominant zeros and the performance of the algorithms are illustrated by examples from practical power system models.
منابع مشابه
Efficient computation of transfer function dominant poles of large second-order dynamical systems
A new algorithm for the computation of dominant poles of transfer functions of large-scale second-order dynamical systems is presented: Quadratic Dominant Pole Algorithm (QDPA). The algorithm works directly with the system matrices of the original system, so no linearization is needed. To improve global convergence, QDPA uses subspace acceleration, and deflation of found dominant poles is imple...
متن کاملMethods for Finding Transfer Function Zeros of Power Systems
This paper is probably the first to describe algorithms suited to the efficient calculation of both proper and non-proper transfer function zeros of linearized dynamic models for large interconnected power systems. The paper also describes an improvement to the well known AESOPS algorithm, formulating it as an exact transfer function zero finding problem which is efficiently solved by a Newton-...
متن کاملComputing Transfer Function Dominant Poles of Large-Scale Second-Order Dynamical Systems
A new algorithm for the computation of dominant poles of transfer functions of largescale second-order dynamical systems is presented: the quadratic dominant pole algorithm (QDPA). The algorithm works directly with the system matrices of the original system, so no linearization is needed. To improve global convergence, the QDPA uses subspace acceleration, and deflation of found dominant poles i...
متن کاملStrongly stable algorithm for computing periodic system zeros
We propose a computationally efficient and numerically reliable algorithm to compute the finite zeros of a linear discrete-time periodic system. The zeros are defined in terms of the transfer-function matrix corresponding to an equivalent lifted time-invariant state-space system. The proposed method relies on structure preserving manipulations of the associated system pencil to extract successi...
متن کاملOn computing the zeros of periodic systems
We present an efficient and numerically reliable approach to compute the zeros of a periodic system. The zeros are defined in terms of the transfer-function matrix corresponding to an equivalent lifted statespace representation as constant system. The proposed method performs locally row compressions of the associated system pencil to extract a low order pencil which contains the zeros (both fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006